An Enhanced ABC algorithm to Solve the Vehicle Routing Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملAn Improved Ant Colony Algorithm to Solve Vehicle Routing Problem with Time Windows
This paper presents an improved ant colony optimization algorithm (ACO algorithm) based on Ito differential equations, the proposed algorithm integrates the versatility of Ito thought with the accuracy of ACO algorithm in solving the vehicle routing problem (VRP), and it executes simultaneous move and wave process, and employs exercise ability to unify move and wave intensity. Move and wave ope...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows
This paper presents a parallel memetic algorithm for solving the vehicle routing problem with time windows (VRPTW). The VRPTW is a well-known NP-hard discrete optimization problem with two objectives. The main objective is to minimize the number of vehicles serving customers scattered on the map, and the second one is to minimize the total distance traveled by the vehicles. Here, the fleet size...
متن کاملEvolutionary Local Search Algorithm to Solve the Multi-Compartment Vehicle Routing Problem with Time Windows
Vehicle routing problems (VRPs) represent an important research stream in applied combinatorial optimization. As the problems emerging from the practice become more constrained and large, more sophisticated approaches are required to address them. This paper tackles the Multiple Compartment Vehicle Routing Problem with Time Windows. This extension of the classical VRP consists of an unlimited h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ECTI Transactions on Computer and Information Technology (ECTI-CIT)
سال: 2020
ISSN: 2286-9131,2286-9131
DOI: 10.37936/ecti-cit.2020141.200016